A Heuristic Approach for Solving the Multi-Pallet Packing Problem
نویسندگان
چکیده
We consider the Distributer's Pallet Packing Problem. This problem is to pack a set of distinct products with given quantities in greater volumes (pallets, containers) and to minimize the number of used volumes. The theoretical objective of nding the best space utilization is restricted by a list of practical aspects (technological constraints, weight distribution over the pallet, stability aspects, etc.). Keeping in mind a general branch and bound framework an eecient heuristic for the considered multi-pallet packing problem is developed. The three-dimensional solution approach uses in the kernel a layer-wise packing strategy with optimal two-dimensional packing patterns. Linear Programming lower bounds for the number of pallets needed to pack the total consignment are developed. Computational experiments show the eeciency of the proposed algorithms.
منابع مشابه
Heuristic Approach for Solving the Multi - PalletPacking
We consider the Distributer's Pallet Packing Problem. This problem is to pack a set of distinct products with given quantities in greater volumes (pallets, containers) and to minimize the number of used volumes. The theoretical objective of nding the best space utilization is restricted by a list of practical aspects (technological constraints, weight distribution over the pallet, stability asp...
متن کاملPresentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem
The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...
متن کاملDistribution network optimization: Finding the most economic solution by using genetic algorithms
lal Ib~ (c~ Fig. 6. Applying the 4-block heuristics for three-dimensional pallet loading. (a) Layer 1; (b) Layer 2; (c) Layer 3. In this paper the problem of calculating optimal packing patterns of small rectangles on a pallet is considered. We propose new heuristics which are based on the 4-block structure of packing patterns. Since, in general, for practical applications additional restrictio...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملارائه یک مدل ریاضی و روش ابتکاری جدید برای حل مسئله مسیریابی وسایل نقلیه چند قرارگاهی و چند محصولی با وسایل نقلیه متفاوت
A mathematical model and heuristic method for solving multi-depot and multi-product vehicle routing problem with heterogeneous vehicle have been proposed in this paper. Customers can order several products and depots must deliver customer's orders before due date with different vehicle. Hence mathematical model of multi-depot vehicle routing problem has been developed to represent these condi...
متن کامل